'Weak Dependency Graph [60.0]'
------------------------------
Answer:           YES(?,O(1))
Input Problem:    innermost runtime-complexity with respect to
  Rules: {a(b(x)) -> a(c(b(x)))}

Details:         
  We have computed the following set of weak (innermost) dependency pairs:
   {a^#(b(x)) -> c_0(a^#(c(b(x))))}
  
  The usable rules are:
   {}
  
  The dependency graph contains no edges.
  
  We are done: the estimated dependency graph contains no edges and moreover, the usable rules are empty.